Three-level BDDC
نویسنده
چکیده
BDDC (Balancing Domain Decomposition by Constraints) methods, so far developed for two levels [3, 7, 8], are similar to the balancing Neumann-Neumann algorithms. However, the BDDC coarse problem is given in terms of a set of primal constraints and the matrix of the coarse problem is generated and factored by direct solvers at the beginning of the computation. The coarse component of the preconditioner can ultimately become a bottleneck if the number of subdomains is very large. In this paper, two three-level BDDC methods are introduced for solving the coarse problem approximately in two and three dimensions, while still maintaining a good convergence rate. Estimates of the condition numbers are provided for the two three-level BDDC methods and numerical experiments are also discussed.
منابع مشابه
A Three-Level BDDC Algorithm for Mortar Discretizations
In this talk, three-level BDDC algorithms will be presented for the solutions of large sparse linear algebraic systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In the algorithms, the large coarse problems from two-level BDDC algorithms are solved approximately while a...
متن کاملA Three-level Bddc Algorithm for Saddle Point Problems
BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and ...
متن کاملA three-level BDDC algorithm for a saddle point problem
Abstract BDDCalgorithms have previously been extended to the saddle point problems arising frommixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generat...
متن کاملCoupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver
We study the effect of adaptive mesh refinement on a parallel domain decomposition solver of a linear system of algebraic equations. These concepts need to be combined within a parallel adaptive finite element software. A prototype implementation is presented for this purpose. It uses adaptive mesh refinement with one level of hanging nodes. Two and three-level versions of the Balancing Domain ...
متن کاملRE PU BL IC Adaptive - Multilevel BDDC and its parallel implementation
We combine the adaptive and multilevel approaches to the BDDC and formulate a method which allows an adaptive selection of constraints on each decomposition level. We also present a strategy for the solution of local eigenvalue problems in the adaptive algorithm using the LOBPCG method with a preconditioner based on standard components of the BDDC. The effectiveness of the method is illustrated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005